Manipulating algebraic specifications with term-based and graph-based representations

نویسندگان

  • Anamaria Martins Moreira
  • Christophe Ringeissen
  • David Déharbe
  • Gleydson Lima
چکیده

In an environment of continuous and rapid evolution, software design methodologies must incorporate techniques and tools that support changes in software artifacts. In the FERUS project, we are developing a tool targeted at software designers that integrates a collection of operations on algebraic specifications written in the CASL language. The scope of FERUS includes not only modification of existing specifications, but also creation or derivation of new specifications, as well as their proof and execution, which are realized through inter-operability with existing tools. As FERUS involves the manipulation of software specification and inter-operability with other tools, the question of choosing appropriate representation formats is important. In this paper, we discuss the advantages and limitations of ATerms as a manipulation and exchange format in the setting of FERUS. We also present a new, graph-like format, which offers complementary features to a term-based format. Moreover, we present visualization utilities for these formats. © 2003 Elsevier Inc. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Grammatica : An Implementation of Algebraic Graph Transformation on Mathematica ⋆

Grammatica is a prototype implementation of algebraic graph transformation based on relation algebra. It has been implemented using Mathematica on top of the Combinatorica package, and runs therefore on most platforms. It consists of Mathematica routines for representing, manipulating, displaying and transforming graphs, as well as routines implementing some relation algebra-theoretic operation...

متن کامل

APE: An Expert System for Automatic Programming from Abstract Specifications of Data Types and Algorithms

The APE (Automatic Programming Expert) system constructs executable and efficient programs from ■ algebraic specifications of abstract data types, and • abstract algorithms given as conditional term-rewrite-rule-systems with term', built up from operation symbols of the abstract data types involved. The APE is an experimental system devised to develop methods for codifying a rather broad extent...

متن کامل

The Banach Type Contraction for Mappings on Algebraic Cone Metric Spaces Associated with An Algebraic Distance and Endowed with a Graph

In this work, we define the notion of an algebraic distance in algebraic cone metric spaces defined by Niknam et al. [A. Niknam, S. Shamsi Gamchi and M. Janfada, Some results on TVS-cone normed spaces and algebraic cone metric spaces, Iranian J. Math. Sci. Infor. 9 (1) (2014), 71--80] and introduce some its elementary properties. Then we prove the existence and uniqueness of fixed point for a B...

متن کامل

Algebraic Matching of Vulnerabilities in a Low-Level Code

This paper explores the algebraic matching approach for detection of vulnerabilities in binary codes. The algebraic programming system is used for implementing this method. It is anticipated that models of vulnerabilities and programs to be verified are presented as behavior algebra and action language specifications. The methods of algebraic matching are based on rewriting rules and techniques...

متن کامل

A Graph Syntax for Processes and Services

We propose a class of hierarchical graphs equipped with a simple algebraic syntax as a convenient way to describe the configurations of languages equipped with inherently hierarchical features such as sessions, fault-handling scopes, transactions or locations. The graph syntax can be seen as an intermediate representation language, that facilitates the encoding of algebraic specifications and, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Log. Algebr. Program.

دوره 59  شماره 

صفحات  -

تاریخ انتشار 2004